New linear codes over GF(8)1
نویسنده
چکیده
Let [n, k, d]q-code be a linear code of length n, dimension k and minimum Hamming distance d over GF (q). One of the most important problems in coding theory is to construct codes with best possible minimum distances. Recently, the class of quasi-cyclic (QC) codes has been proven to contain many such codes. In this paper, thirty two codes over GF (8) are constructed (among them one optimal code), which improve the best known lower bounds on minimum distance.
منابع مشابه
Optimal Linear Codes Over GF(7) and GF(11) with Dimension 3
Let $n_q(k,d)$ denote the smallest value of $n$ for which there exists a linear $[n,k,d]$-code over the Galois field $GF(q)$. An $[n,k,d]$-code whose length is equal to $n_q(k,d)$ is called {em optimal}. In this paper we present some matrix generators for the family of optimal $[n,3,d]$ codes over $GF(7)$ and $GF(11)$. Most of our given codes in $GF(7)$ are non-isomorphic with the codes pre...
متن کاملLinear codes with complementary duals related to the complement of the Higman-Sims graph
In this paper we study codes $C_p(overline{{rm HiS}})$ where $p =3,7, 11$ defined by the 3- 7- and 11-modular representations of the simple sporadic group ${rm HS}$ of Higman and Sims of degree 100. With exception of $p=11$ the codes are those defined by the row span of the adjacency matrix of the complement of the Higman-Sims graph over $GF(3)$ and $GF(7).$ We show that these codes ha...
متن کاملMATHEMATICS AND EDUCATION IN MATHEMATICS, 2001 Proceedings of Thirtieth Spring Conference of the Union of Bulgarian Mathematicians Borovets, April 8–11, 2001 NEW SYSTEMATIC QUASI-CYCLIC CODES OVER GF (9) IN DIMENSIONS 7 AND 8
Let [n, k, d]q-codes be linear codes of length n, dimension k and minimum Hamming distance d over GF (q). In this paper, the existence of the next recordbreaking codes [35, 7, 23]9, [42, 7, 29]9, [49, 7, 34]9, [56, 7, 40]9, [63, 7, 46]9, [98, 7, 75]9, [105, 7, 81]9, [112, 7, 87]9, [119, 7, 93]9, [126, 7, 99]9, [133, 7, 105]9, [48, 8, 32]9, [56, 8, 39]9, [104, 8, 78]9, [112, 8, 85]9, [120, 8, 91...
متن کاملSome results on self-orthogonal and self-dual codes
We use generator matrices G satisfying GGT = aI+bJ over Zk to obtain linear self-orthogonal and self-dual codes. We give a new family of linear self-orthogonal codes over GF(3) and Z4 and a new family of linear selfdual codes over GF(3).
متن کاملAnother q-Polynomial Approach to Cyclic Codes
c0 + c1x+ c2x 2 + · · ·+ cn−1x n−1 ∈ GF(q)[x]/(x − 1), any code C of length n over GF(q) corresponds to a subset of the quotient ring GF(q)[x]/(xn− 1). A linear code C is cyclic if and only if the corresponding subset in GF(q)[x]/(xn − 1) is an ideal of the ring GF(q)[x]/(xn − 1). It is well known that every ideal of GF(q)[x]/(xn−1) is principal. Let C = 〈g(x)〉 be a cyclic code, where g(x) is m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008